Characterization and Armstrong Relations for Degenerate Multivalued Dependencies Using Formal Concept Analysis

نویسندگان

  • Jaume Baixeries
  • José L. Balcázar
چکیده

Functional dependencies, a notion originated in Relational Database Theory, are known to admit interesting characterizations in terms of Formal Concept Analysis. In database terms, two successive, natural extensions of the notion of functional dependency are the socalled degenerate multivalued dependencies, and multivalued dependencies proper. We propose here a new Galois connection, based on any given relation, which gives rise to a formal concept lattice corresponding precisely to the degenerate multivalued dependencies that hold in the relation given. The general form of the construction departs significantly from the most usual way of handling functional dependencies. Then, we extend our approach so as to extract Armstrong relations for the degenerate multivalued dependencies from the concept lattice obtained; the proof of the correctness of this construction is nontrivial.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Formal Context for Acyclic Join Dependencies

Acyclic Join Dependencies (AJD) play a crucial role in database design and normalization. In this paper, we use Formal Concept Analysis (FCA) to characterize a set of AJDs that hold in a given dataset. This present work simplifies and generalizes the characterization of Multivalued Dependencies with FCA.

متن کامل

SLFD Logic: Elimination of Data Redundancy in Knowledge Representation

In this paper, we propose the use of formal techniques on Software Engineering in two directions: 1) We present, within the general framework of lattice theory, the analysis of relational databases. To do that, we characterize the concept of f-family (Armstrong relations) by means of a new concept which we call non-deterministic ideal operator. This characterization allows us to formalize datab...

متن کامل

Conf . on ERA DECOMPOSITION OF RELATIONS AND SYNTHESIS OF ENTITY - RELATIONSHIP DIAGRAMS Michel

We will attack this problem using the formal framework of the Relational Data Model [CODD 70, DATE 773. Requirement Cl), which has been called the comolete relatability requirement should, strictly speaking, include all the integrity constraints applicable to the data. However, tne state-of-the-art regarding the formal analysis of integrity constraints is limited to functional dependencies (abb...

متن کامل

Discovery of multivalued dependencies from relations

Discovery of multivalued dependencies from database relations is viewed as a search in a hypothesis space de ned according to the generalisation relationship among multivalued dependencies Two algorithms for the dis covery of multivalued dependencies from relations are presented The top down algorithm enumerates the hypotheses from the most general to more speci c hypotheses which are checked o...

متن کامل

Association Mining and Formal Concept Analysis

In this paper, we develop a connection between association queries and formal concept analysis. An association query discovers dependencies among values of an attribute grouped by other, non-primary attributes in a given relation. Formal concept analysis deals with formal mathematical tools and techniques to develop and analyze relationship between concepts and to develop concept structures. We...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005